W-weighted GDMP inverse for rectangular matrices
نویسندگان
چکیده
In this article, we introduce two new generalized inverses for rectangular matrices called $W$-weighted generalized-Drazin--Moore--Penrose (GDMP) and generalized-Drazin-reflexive (GDR) inverses. The first inverse can be seen as a generalization of the recently introduced GDMP square matrix to matrix. second class contains inverse. We then exploit their various properties establish that proposed coincide with different well-known under certain assumptions. also obtain representation employing EP-core nilpotent decomposition. define dual analogue results. Further, discuss additive properties, reverse- forward-order laws GD, GDMP,
منابع مشابه
Representation for the W -weighted Drazin inverse of linear operators
In this paper we study the W -weighted Drazin inverse of the bounded linear operators between Banach spaces and its representation theorem. Based on this representation, utilizing the spectral theory of Banach space operators, we derive an approximating expression of the W -weighted Drazin inverse and an error bound. Also, a perturbation theorem for the W -weighted Drazin inverse is uniformly o...
متن کاملCondition number of the W-weighted Drazin inverse
In this paper we get the explicit condition number formulas for the W–weighted Drazin inverse of a rectangular matrix using the Schur decomposition and the spectral norm. We characterize the spectral norm and the Frobenius norm of the relative condition number of the W– weighted Drazin inverse, and the level-2 condition number of the W– weighted Drazin inverse. The sensitivity for the W–weighte...
متن کاملDistances in Weighted Trees and Group Inverse of Laplacian Matrices
In this paper we find formulas for group inverses of Laplacians of weighted trees. We then develop a relationship between entries of the group inverse and various distance functions on trees. In particular, we show that the maximal and minimal entries on the diagonal of the group inverse correspond to certain pendant vertices of the tree and to a centroid of the tree, respectively. We also give...
متن کاملSparsiication of Rectangular Matrices
Given a rectangular matrix with more columns than rows, nd a base of linear combinations of the row vectors such that these contain as many zero entries as possible. This process is called \sparsiication" (of the matrix). A combinatorial search method to solve sparsiication is presented which needs exponentially many arithmetic operations (in terms of the size of the matrix). However, various p...
متن کاملPseudospectra of rectangular matrices
Pseudospectra of rectangular matrices vary continuously with the matrix entries, a feature that eigenvalues of these matrices do not have. Some properties of eigenvalues and pseudospectra of rectangular matrices are explored, and an efficient algorithm for the computation of pseudospectra is proposed. Applications are given in (square) eigenvalue computation (Lanczos iteration), square pseudosp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Linear Algebra
سال: 2022
ISSN: ['1081-3810', '1537-9582']
DOI: https://doi.org/10.13001/ela.2022.7015